Involutions on Standard Young Tableaux and Divisors on Metric Graphs

نویسندگان

  • Rohit Agrawal
  • Gregg Musiker
  • Vladimir Sotirov
  • Fan Wei
چکیده

We elaborate upon a bijection discovered by Cools, Draisma, Payne, and Robeva in [CDPR12] between the set of rectangular standard Young tableaux and the set of equivalence classes of chip configurations on certain metric graphs under the relation of linear equivalence. We present an explicit formula for computing the v0-reduced divisors (representatives of the equivalence classes) associated to given tableaux, and use this formula to prove (i) evacuation of tableaux corresponds (under the bijection) to reflecting the metric graph, and (ii) conjugation of the tableaux corresponds to taking the Riemann-Roch dual of the divisor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combinatorics of Arc Diagrams, Ferrers Fillings, Young Tableaux and Lattice Paths

Several recent works have explored the deep structure between arc diagrams, their nestings and crossings, and several other combinatorial objects including permutations, graphs, lattice paths, and walks in the Cartesian plane. This thesis inspects a range of related combinatorial objects that can be represented by arc diagrams, relationships between them, and their connection to nestings and cr...

متن کامل

Similar constructions for young tableaux and involutions, and their application to shiftable tableaux

which has a straightforward combinatorial proof when an is the number of involutions of [n], must also hold when an is the number of Young tableaux on [n]. In this paper, we first give (Section 3) a combinatorial proof of (1) for Young tableaux which agrees under the Robinson-Schensted correspondence with the proof for involutions. The proof involves a recursive construction which depends in pa...

متن کامل

The Eulerian distribution on self evacuated involutions

We present an extensive study of the Eulerian distribution on the set of self evacuated involutions, namely, involutions corresponding to standard Young tableaux that are fixed under the Schützenberger map. We find some combinatorial properties for the generating polynomial of such distribution, together with an explicit formula for its coefficients. Afterwards, we carry out an analogous study ...

متن کامل

A Combinatorial Setting for Involutions and Semistandard Young Tableaux

We establish a combinatorial connection between the sequence (yn,k) counting the involutions on n letters with k descents and the sequence (an,k) enumerating the semistandard Young tableaux on n cells with k symbols. This allows us to exhibit an explicit formula for the integers yn,k and find combinatorial properties of the two sequences. In particular, we show that the sequences (yn,k) are not...

متن کامل

2 S ep 2 00 4 Subsequence containment by involutions

Inspired by work of McKay, Morse, and Wilf, we give an exact count of the involutions in Sn which contain a given permutation τ ∈ Sk as a subsequence; this number depends on the patterns of the first j values of τ for 1 ≤ j ≤ k. We then use this to define a partition of Sk, analogous to Wilf-classes in the study of pattern avoidance, and examine properties of this equivalence. In the process, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2013